Data-Structures-and-Algorithms/Trees/Level Order Traversal of Binart Tree.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/Trees/Level Order Traversal of Binart Tree.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.6 (2697 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
classSolution {
public:
voidburnTree(TreeNode *root, int time, vector<vector<int>> &ans)
 {
if(root==NULL)
return;
if(time==ans.size())
 ans.push_back({});
 ans[time].push_back(root->val);
burnTree(root->left, time+1, ans);
burnTree(root->right, time+1, ans);
 }
 vector<vector<int>> levelOrder(TreeNode* root) {
 vector<vector<int>> ans;
burnTree(root, 0, ans);
return ans;
 }
};